list structure
英 [lɪst ˈstrʌktʃə(r)]
美 [lɪst ˈstrʌktʃər]
网络 表结构; 显示表结构
双语例句
- We can now modify our script further to read these machine names into a list structure, and connect to the registries of each one in turn.
现在我们可以进一步修改脚本以把这些机器名读取到一个列表结构中，并轮流连接到每台机器的注册表。 - As long as you append to the front of the list, you won't even have to touch the existing list structure, allowing other threads to iterate through it freely.
当向列表前添加元素时，甚至不必修改现有的列表结构，就可以让其他线程自由地遍历它。 - The client that reads my schema must be able to understand that I am describing such a linked list structure and thus must accept all possible versions of the XML that de-serialize to the same graph.
读取我模式的客户机必须能理解我在描述这样一个链表结构，并且必须接受所有可能的反序列化相同图的XML版本。 - Note, though, that if you added elements to the end of the list rather than to the front, you would be directly modifying the list structure itself.
不过，要注意的是，如果将元素添加到列表的末尾而不是添加到最前面，那么您将会直接修改链表结构本身。 - Storing data: A more generic list structure
存储数据：更为普通的列表结构 - It may appear that the list structure can handle only linearly sequenced values, but they can also handle "inverted trees" by using shared sublists& this is not what I'm discussing here.
可能看起来列表结构只能处理线性排列的值，但是，通过使用共享子列表，它们也可以处理“反转树（invertedtree）”&在这里我没有对这一内容进行讨论。 - The problem arises when I try to create an XML Schema that describes the linked list structure.
当我试图创建一个描述链表结构的XMLSchema，问题产生了。 - So inside the assembly, the regroup step is used to eliminate these duplications and to create a desired nested list structure.
因此在程序集内，重新组合步骤用于消除这些重复并创建所需的嵌套列表结构。 - Queues that can hold a mixture of persistent and non-persistent messages must be defined in the persistent list structure.
可以容纳持久性和非持久性消息的混合的队列必须在持久性列表结构中定义。 - While this is detrimental to blogs and articles with continuous prose, this is obviously beneficial for lists of things, as the reader is reading in a pattern that largely follows a list structure.
这一模式不利于登载系列散文的博客和文章，却显然有利于清单，因为读者阅读的模式很大程度上遵循了清单的结构。 - Ordered Adjacency Vertex List Structure for Subdivision Surfaces
细分曲面的有序邻接顶点表数据结构 - The source of trouble and logical relationship of fault propagation was represented by fault tree from top event to bottom event to form fault analysis branch, and in knowledge base, they were stored with linked list structure.
并用故障树表示故障原因及其故障传播逻辑关系，从故障树的顶事件至底事件形成故障分析支路，在知识库中以链表的结构进行存储。 - Queue and link list structure is used in data transfer management. User status is transferred independent of bridge status.
采用队列和链表结构进行数据收发管理，收发方向上的用户状态信息和桥接器状态信息可以独立传递，能够独立配置每个用户的工作属性。 - The method is validated by computing the TEAM Problem 21.The cross list structure is modified and a new data structure is presented.
通过对TEAM21问题的求解验证了本文方法的正确性。对十字链表结构进行了改进，提出了一种新的存储技术。 - The nested list structure and its application in Turbo-PROLOG
Turbo-Prolog的表内套表结构及其应用 - Adopting multithreading technology, memory data managing technology and the high efficiency list structure to store the data in the database, reducing the frequent operation on the disk, this method can advance the real time and reacting speed of the system;
采用多线程技术与内存数据管理技术，运用高效链式存储结构实现内存数据到存储介质的转存，减少了对磁盘的频繁操作，提高系统的实时性和响应速度； - This paper present a design method and implementation process of nested menu in common use by applying multiple linked list structure and stacked technology in large-scale data processing system.
本文介绍了在大型数据管理系统中，应用多重链表结构与堆栈技术实现通用嵌套菜单的设计方法及实现过程。 - This article chiefly introduces the main idea of the software system and the method of its realization especially the basic idea of list structure, graph processing, and object formation etc.
本文着重介绍本软件系统的主要思想和实现方法，主要是表结构，图形处理，目标生成等基本内容。 - This paper presents an improved task scheduling method by extending the Ready List structure of μ C/ OS-ⅱ to eliminate the restriction mentioned above.
本文通过扩展μC／OS-Ⅱ的就绪表结构提出了一个改进了的任务调度方法以消除以上限制。 - During the design of the algorithms, we discuss the problem in existence with the thought of mathematics set, and design the flow of algorithms using backtracking algorithms, then implement it by list structure, finally present the pseudocode for core algorithm.
在设计排课算法中，我们主要用数学集合的思想来讨论存在的问题，然后采用回溯算法设计出算法的流程，最后再采用链表的结构加于实现，并给出了核心算法的伪代码。 - One realization method of Godin algorithm based on linked list structure is presented. Concept lattice node is organized as linked list structure, which helps to quickly search the child node by using indexed table. Accordingly, the time-efficiency of concept lattice incremental construction is improved.
给出了一种基于链表结构的Godin算法实现方法，该方法采用链表结构组织格结点，并利用索引表，实现了对概念格子结点的快速查找，提高了概念格渐进式构造的效率。 - A migrating workflow navigation model was defined based on the service type classification provided by the anchorage server, the previous service entity list structure of anchorage server was expanded, and the task execution process of migrating instances was described in detail.
在对停靠站服务器提供的服务进行类型划分的基础上，定义了迁移工作流系统的导航模型，扩充了停靠站服务器的服务主体表结构，详细描述了基于导航的迁移实例的任务执行过程。 - The Redundance in Chained-list Structure Program
关于链表结构程序中的代码冗余问题 - Because of the inverse adjacency list structure, this algorithm is much simple and easy to be fulfilled.
采用逆邻接表作为图的存储结构，该算法很容易实现。 - Due to its unique Ready List structure, μ C/ OS-ⅱ behaves efficiently in task scheduling.
由于其独特的就绪表结构，μC／OS-Ⅱ在任务调度方面表现出极高的效率。 - List structure is commonly used, the intersection roads can not handle.
通常采用的是链表结构对于相交道路无法处理。 - In addition, during the increment mining process, it designs special list structure.
另外，在进行增量挖掘时，对链表结构进行特殊设计。 - Using the new system area storage management structure, using blocks of double-linked list structure, management and occupation of free blocks to improve the efficiency of space utilization and service response.
使用新的系统区存储管理结构，采用双链表结构管理空闲块和占用块，提高空间利用率和服务响应效率。 - On this basis, the paper on the Oracle software platform was designed to fit in the GIS database list structure, and has given examples of table relationships with the ER diagram.
在此基础之上，利用Oracle的软件平台设计了适配于GIS的数据库链表结构，用ER图给出表关系的示例。 - Because the three-dimensional linked list structure of Snort rule library is complex, this paper uses a simplified approach, which is extracting the pattern strings to be matched in Snort rules library to apply to GPU_WM algorithm.
因Snort规则库三维链表组织结构较为复杂，目前采用的临时处理办法是对Snort规则库中的待匹配模式串进行了提取以适用于GPUWM算法。